A Novel Binary Ant Colony Optimization: Application to the Unit Commitment Problem of Power Systems
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Modified Ant Colony Optimization Technique for Solving Unit Commitment Problem
Ant colony optimization (ACO) which is inspired by the natural behavior of ants in finding the shortest path to food is appropriate for solving the combinatorial optimization problems. Therefore, it is used to solve the unit commitment problem (UCP) and attain the minimum cost for scheduling thermal units in order to produce the demand load. In this paper modified ACO (MACO) is used to solve th...
متن کاملEvolving ant colony optimization based unit commitment
Ant colony optimization (ACO) was inspired by the observation of natural behavior of real ants’ pheromone trail formation and foraging. Ant colony optimization ismore suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem. Multistage decision making of ACO gives an edge over other conventional methods. This paper proposes evolving ant col...
متن کاملUnit Commitment by Evolving Ant Colony Optimization
Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) f...
متن کاملDiscrete genetic algorithm and real ant colony optimization for the unit commitment problem
In this paper, a cooperative metaheuristic for the solution of the Unit Commitment problem is presented. This problem is known to be a large scale, mixed integer problem. Due to combinatorial complexity, the exact solution is often intractable. Thus, a metaheuristic based method has to be used to compute a near optimal solution with low computation times. A new approach is presented here. The m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electrical Engineering and Technology
سال: 2011
ISSN: 1975-0102
DOI: 10.5370/jeet.2011.6.2.174